Resultants of partially composed polynomials

نویسنده

  • Manfred Minimair
چکیده

We study the structure of resultants of two homogeneous partially composed polynomials. By two homogeneous partially composed polynomials we mean a pair of polynomials of which one does not have any given composition structure and the other one is obtained by composing a bivariate homogeneous polynomial with two bivariate homogeneous polynomials. The main contributions are two equivalent formulas, each representing the resultant of two partially composed polynomials as a certain iterated resultant of the component polynomials. Furthermore, in many cases, this iterated resultant can be computed with dramatically increased efficiency, as demonstrated by experiments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse Resultant of Composed Polynomials IMixed-. Unmixed Case

The main question of this paper is: What happens to sparse resultants under composition? More precisely, let f1, . . . , fn be homogeneous sparse polynomials in the variables y1, . . . , yn and g1, . . . , gn be homogeneous sparse polynomials in the variables x1, . . . , xn. Let fi ◦ (g1, . . . , gn) be the sparse homogeneous polynomial obtained from fi by replacing yj by gj . Naturally a quest...

متن کامل

Fast computation of special resultants

We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multivariate resultants, that we compute using power sums of roots of polynomials, by means of their generating series.

متن کامل

Cayley-Dixon construction of Resultants of Multi-Univariate Composed Polynomials

The Cayley-Dixon formulation for multivariate resultants have been shown to be efficient (both experimentally and theoretically) for computing resultants by simultaneously eliminating many variables from a polynomial system. In this paper, the behavior of Cayley-Dixon resultant construction and the structure of Dixon matrices is analyzed for composed polynomial systems constructed from a multiv...

متن کامل

Fast Computation With Two Algebraic Numbers

We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special resultants, that we compute using power sums of roots of polynomials, by means of their generating series.

متن کامل

Dense resultant of composed polynomials: Mixed-mixed case

The main question of this paper is: What is the dense (Macaulay) resultant of composed polynomials? By a composed polynomial f ◦ (g1, . . . , gn), we mean the polynomial obtained from a polynomial f in the variables y1, . . . , yn by replacing yj by by some polynomial gj . Cheng, McKay and Wang and Jouanolou have provided answers for two particular subcases. The main contribution of this paper ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2006